Colouring the discretization graphs arising in the multigrid method
نویسندگان
چکیده
منابع مشابه
the u.s. policy in central asia and its impact on the colored revolutions in the region (the case study of tulip revolution in kyrgyzstan)
چکیده ندارد.
15 صفحه اولromantic education:reading william wordsworths the prelude in the light of the history of ideas
عصر روشنگری زمان شکل گیری ایده های مدرن تربیتی- آموزشی بود اما تاکید بیش از اندازه ی دوشاخه مهم فلسفی زمان یعنی عقل گرایی و حس گرایی بر دقت و وضوح، انسان عصر روشنگری را نسبت به دیگر تواناییهایش نابینا کرده و موجب به وجود آمدن افرادی تک بعدی شد که افتخارعقلانیتشان، تاکید شان بر تجربه فردی، به مبارزه طلبیدن منطق نیاکانشان وافسون زدایی شان از دنیا وتمام آنچه با حواس پنجگانه قابل درک نبوده و یا در ...
On the Edge-colouring of Split Graphs on the Edge-colouring of Split Graphs
We consider the following question: can split graphs with odd maximum degree be edge-coloured with maximum degree colours? We show that any odd maximum degree split graph can be transformed into a special split graph. For this special split graph, we were able to solve the question, in case the graph has a quasi-universal vertex.
متن کاملColouring proximity graphs in the plane
Given a set V of points in the plane and given d >O, let G( V, d) denote the graph with vertex set V and with distinct vertices adjacent whenever the Euclidean distance between them is less than d. We are interested in colouring such ‘proximity’ graphs. One application where this problem arises is in the design of cellular telephone networks, where we need to assign radio channels (colours) to ...
متن کاملOn Edge-colouring Indiierence Graphs on Edge-colouring Indiierence Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G)+1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for indi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90181-3